Logics for Computer Science by Anita Wasilewska

Author:Anita Wasilewska
Language: eng
Format: epub
ISBN: 9783319925912
Publisher: Springer International Publishing

(6.7)

elements of , i.e. Γ ′,  Δ ′,  Σ ′ are finite sequences (empty included) formed out of literals. We call them indecomposable sequences.

We denote by

(6.8)

the elements of , i.e. Γ,  Δ,  Σ denote finite sequences (empty included) formed out of elements of .

Logical Axioms LA

As the logical axiom of RS we adopt any sequence of literals which contains any propositional variable and its negation, i.e. any sequence of the form

(6.9)

or of the form

(6.10)

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.